Heisenberg's commutation relation and the Plancherel theorem
نویسندگان
چکیده
منابع مشابه
• Fourier transform and Plancherel Theorem
When we try to transfer these three concepts to a “curved manifold” M , the situation becomes instantly very complicated. Let us look for an appropriate class of M ’s for which we can expect satisfactory answers. We need the requirement to measure distances, so M should be Riemannian. In order to have a reasonable theory of selfadjoint operators on M we also need completeness. But still the cla...
متن کاملThe semantics of the canonical commutation relation
1.1 This paper is a part of a much broader project which aims to establish, for a typical ’co-ordinate algebra’ A in the sense of non-commutative geometry, or a scheme, a geometric counterpart VA. Here “geometric” should also be understood in some broad but well-defined sense. We believe this is possible in the setting of model theory, where a crucial new experience in generalisation of semanti...
متن کاملCanonical Commutation Relation Preserving Maps
We study maps preserving the Heisenberg commutation relation ab − ba = 1. We find a one-parameter deformation of the standard realization of the above algebra in terms of a coordinate and its dual derivative. It involves a non-local “coordinate” operator while the dual “derivative” is just the Jackson finite-difference operator. Substitution of this realization into any differential operator in...
متن کاملCentral Limit Theorem for Random Partitions under the Plancherel Measure
A partition of a natural number n is any integer sequence λ = (λ1, λ2, . . . ) such that λ1 ≥ λ2 ≥ · · · ≥ 0 and λ1 + λ2 + · · · = n (notation: λ ⊢ n). In particular, λ1 = max{λi ∈ λ}. Every partition λ ⊢ n can be represented geometrically by a planar shape called the Young diagram, consisting of n unit cell arranged in consecutive columns, containing λ1, λ2, . . . cells, respectively. On the s...
متن کاملAn umbral relation between pattern and commutation in strings
Two settings for string enumeration are considered in which string statistics can be constructed such that the generating series for the set of all strings have the form (F-r c a)’ in both cases, where F is a formal power series and u is a sequence. The two settings are qualitatively different. one involving pattern, which is locally testable, and the other involving commutation in strings, whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1961
ISSN: 0386-2194
DOI: 10.3792/pja/1195523709